On Linear Discriminant Analysis with Adaptive Ridge Classification Rules
نویسندگان
چکیده
منابع مشابه
Classification Using Linear Discriminant Analysis and Quadratic Discriminant Analysis
2 Classification of One-Dimensional Data 2 2.1 Linear Discriminant Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.1.1 Building the LDA Classifier . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2.1.2 Results of One-Dimensional LDA Classification . . . . . . . . . . . . . . . . . . . . . . 4 2.2 Quadratic Discriminant Analysis . . . . . ....
متن کاملLinear Discriminant Analysis in Document Classification
Document representation using the bag-of-words approach may require bringing the dimensionality of the representation down in order to be able to make effective use of various statistical classification methods. Latent Semantic Indexing (LSI) is one such method that is based on eigendecomposition of the covariance of the document-term matrix. Another often used approach is to select a small num...
متن کاملOn Model-Based Clustering, Classification, and Discriminant Analysis
The use of mixture models for clustering and classification has burgeoned into an important subfield of multivariate analysis. These approaches have been around for a half-century or so, with significant activity in the area over the past decade. The primary focus of this paper is to review work in model-based clustering, classification, and discriminant analysis, with particular attenti...
متن کاملSeparable Linear Discriminant Classification
Linear discriminant analysis is a popular technique in computer vision, machine learning and data mining. It has been successfully applied to various problems, and there are numerous variations of the original approach. This paper introduces the idea of separable LDA. Towards the problem of binary classification for visual object recognition, we derive an algorithm for training separable discri...
متن کاملDiscriminant Adaptive Nearest Neighbor Classification
Nearest neighbor classification expects the class conditional probabilities to be locally constant, and suffers from bias in high dimensions We propose a locally adaptive form of nearest neighbor classification to try to finesse this curse of dimensionality. We use a local linear discriminant analysis to estimate an effective metric for computing neighborhoods. We determine the local decision b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multivariate Analysis
سال: 1995
ISSN: 0047-259X
DOI: 10.1006/jmva.1995.1036